ROM-based computation: quantum versus classical
نویسندگان
چکیده
منابع مشابه
Quantum-classical Correspondence in the Oracle Model of Computation
The oracle model of computation is believed to allow a rigorous proof of quantum over classical computational superiority. Since quantum and classical oracles are essentially different, a correspondence principle is commonly implicitly used as a platform for comparison of oracle complexity. Here, we question the grounds on which this correspondence is based. Obviously, results on quantum speed-...
متن کاملProviding a Bird Swarm Algorithm based on Classical Conditioning Learning Behavior and Comparing this Algorithm with sinDE, JOA, NPSO and D-PSO-C Based on Using in Nanoscience
There can be no doubt that nanotechnology will play a major role in our futuretechnology. Computer science offers more opportunities for quantum andnanotechnology systems. Soft Computing techniques such as swarm intelligence, canenable systems with desirable emergent properties. Optimization is an important anddecisive activity in structural designing. The inexpensive re...
متن کاملua nt - p h / 06 08 06 0 v 1 7 A ug 2 00 6 Classical simulation versus universality in measurement based quantum computation
We investigate for which resource states an efficient classical simulation of measurement based quantum computation is possible. We show that the Schmidt–rank width, a measure recently introduced to assess universality of resource states, plays a crucial role in also this context. We relate Schmidt–rank width to the optimal description of states in terms of tree tensor networks and show that an...
متن کاملQuantum Computing in Complexity Theory and Theory of Computation
Traditionally, complexity theory has concerned itself with algorithms run by classical computers. With the recent developments in quantum computing, complexity theorists have begun considering just how quantum algorithms fit into the picture. After a brief introduction into classical complexity theory, we consider what is known and what is speculated about the relationship of the class of probl...
متن کاملSolving satisfiability by statistical estimation
What is the powerful ingredient which allows a dramatic speed-up of quantum computation over classical computation ? We propose that this ingredient is an implicit use of the Bayesian probability theory. Furthermore, we argue that both classical and quantum computation are special cases of probability reasoning. On these grounds, introducing Bayesian probability theory in classical computation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Quantum Information & Computation
دوره 2 شماره
صفحات -
تاریخ انتشار 2002